Quadratization of symmetric pseudo-Boolean functions
نویسندگان
چکیده
منابع مشابه
Quadratization of Symmetric Pseudo-Boolean Functions
A pseudo-Boolean function is a real-valued function f(x) = f(x1, x2, . . . , xn) of n binary variables; that is, a mapping from {0, 1}n to R. For a pseudo-Boolean function f(x) on {0, 1}n, we say that g(x, y) is a quadratization of f if g(x, y) is a quadratic polynomial depending on x and on m auxiliary binary variables y1, y2, . . . , ym such that f(x) = min{g(x, y) : y ∈ {0, 1}m} for all x ∈ ...
متن کاملOn quadratization of pseudo-Boolean functions
We survey current term-wise techniques for quadratizing high-degree pseudo-Boolean functions and introduce a new one, which allows multiple splits of terms. We also introduce the first aggregative approach, which splits a collection of terms based on their common parts.
متن کاملLocally monotone Boolean and pseudo-Boolean functions
We propose local versions of monotonicity for Boolean and pseudoBoolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p positions. As it turns out, this parameterized notion provides a hierarchy of monotonicities for pseudo-Boolean (Boolean) functions. Local monotonicities are ...
متن کاملPermutation Independent Comparison of Pseudo Boolean Functions
We address the problem of permutation independent comparison of two pseudo Boolean functions given by multiplicative binary moment diagrams (∗Bmds), i. e., the problem of deciding whether there exists a permutation of the input variables such that the two ∗Bmds are equal. The analogous problem has already been investigated for binary decision diagrams (Bdds) in detail [5, 7, 8, 9, 10]. All thes...
متن کاملCones of Nonnegative Quadratic Pseudo-Boolean Functions
Numerous combinatorial optimization problems can be formulated as the minimization of a quadratic pseudo-Boolean function in n variables, which on its own turn is equivalent with a linear programming problem over the so called Boolean Quadric Polytope (BQ) in n+ ( 2 2 ) dimension (Padberg, 1989). This polytope is very well studied, still we know in fact very little about its structure and its f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.01.001